Two-Grid Methods for Maxwell Eigenvalue Problems
نویسندگان
چکیده
منابع مشابه
Two-Grid Methods for Maxwell Eigenvalue Problems
Two new two-grid algorithms are proposed for solving the Maxwell eigenvalue problem. The new methods are based on the two-grid methodology recently proposed by Xu and Zhou [Math. Comp., 70 (2001), pp. 17-25] and further developed by Hu and Cheng [Math. Comp., 80 (2011), pp. 1287-1301] for elliptic eigenvalue problems. The new two-grid schemes reduce the solution of the Maxwell eigenvalue proble...
متن کاملSuperconvergent Two-Grid Methods for Elliptic Eigenvalue Problems
Some numerical algorithms for elliptic eigenvalue problems are proposed, analyzed, and numerically tested. The methods combine advantages of the two-grid algorithm (Xu and Zhou in Math Comput 70(233):17–25, 2001), the two-space method (Racheva and Andreev in ComputMethods ApplMath 2:171–185, 2002), the shifted inverse powermethod (Hu and Cheng in Math Comput 80:1287–1301, 2011; Yang and Bi in S...
متن کاملA two-grid discretization scheme for eigenvalue problems
A two-grid discretization scheme is proposed for solving eigenvalue problems, including both partial differential equations and integral equations. With this new scheme, the solution of an eigenvalue problem on a fine grid is reduced to the solution of an eigenvalue problem on a much coarser grid, and the solution of a linear algebraic system on the fine grid and the resulting solution still ma...
متن کاملAcceleration of a Two-grid Method for Eigenvalue Problems
This paper provides a new two-grid discretization method for solving partial differential equation or integral equation eigenvalue problems. In 2001, Xu and Zhou introduced a scheme that reduces the solution of an eigenvalue problem on a finite element grid to that of one single linear problem on the same grid together with a similar eigenvalue problem on a much coarser grid. By solving a sligh...
متن کاملJacobi-Davidson methods for polynomial two-parameter eigenvalue problems
We propose Jacobi–Davidson type methods for polynomial two-parameter eigenvalue problems (PMEP). Such problems can be linearized as singular two-parameter eigenvalue problems, whose matrices are of dimension k(k + 1)n/2, where k is the degree of the polynomial and n is the size of the matrix coefficients in the PMEP. When k2n is relatively small, the problem can be solved numerically by computi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Numerical Analysis
سال: 2014
ISSN: 0036-1429,1095-7170
DOI: 10.1137/130919921